A Two-Stage Method for UCAV TF/TA Path Planning Based on Approximate Dynamic Programming
نویسندگان
چکیده
منابع مشابه
Mobile Robot Path Planning based on Dynamic Programming Algorithm
In order to meet the needs of mobile robots to make the global path planning based on a given environment information, related mathematical model was established, and simulation results were given by using the dynamic programming algorithm. In the road traffic path planning, master robot communicates with multiple slave robots through the server, and collects information from slave robots to ad...
متن کاملA Bat Algorithm with Mutation for UCAV Path Planning
Path planning for uninhabited combat air vehicle (UCAV) is a complicated high dimension optimization problem, which mainly centralizes on optimizing the flight route considering the different kinds of constrains under complicated battle field environments. Original bat algorithm (BA) is used to solve the UCAV path planning problem. Furthermore, a new bat algorithm with mutation (BAM) is propose...
متن کاملA Modified Firefly Algorithm for UCAV Path Planning
Path planning for uninhabited combat air vehicle (UCAV) is a complicated high dimension optimization problem, which mainly centralizes on optimizing the flight route considering the different kinds of constrains under complicated battle field environments. Original firefly algorithm (FA) is used to solve the UCAV path planning problem. Furthermore, a new modified firefly algorithm (MFA) is prop...
متن کاملPatient admission planning using Approximate Dynamic Programming
Tactical planning in hospitals involves elective patient admission planning and the allocation of hospital resource capacities. We propose a method to develop a tactical resource allocation and patient admission plan that takes stochastic elements into consideration, thereby providing robust plans. Our method is developed in an Approximate Dynamic Programming (ADP) framework and copes with mult...
متن کاملA Multi-stage Probabilistic Algorithm for Dynamic Path-Planning
Probabilistic sampling methods have become very popular to solve single-shot path planning problems. Rapidlyexploring Random Trees (RRTs) in particular have been shown to be efficient in solving high dimensional problems. Even though several RRT variants have been proposed for dynamic replanning, these methods only perform well in environments with infrequent changes. This paper addresses the d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2018
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2018/1092092